Turing test - Übersetzung nach Englisch
DICLIB.COM
KI-basierte Sprachtools
Geben Sie ein Wort oder eine Phrase in einer beliebigen Sprache ein 👆
Sprache:     

Übersetzung und Analyse von Wörtern durch künstliche Intelligenz

Auf dieser Seite erhalten Sie eine detaillierte Analyse eines Wortes oder einer Phrase mithilfe der besten heute verfügbaren Technologie der künstlichen Intelligenz:

  • wie das Wort verwendet wird
  • Häufigkeit der Nutzung
  • es wird häufiger in mündlicher oder schriftlicher Rede verwendet
  • Wortübersetzungsoptionen
  • Anwendungsbeispiele (mehrere Phrasen mit Übersetzung)
  • Etymologie

Turing test - Übersetzung nach Englisch


Turing test         
examen de turing (examen que determinó el matemático Allen Turing como la capacidad de una máquina de imitar la inteligencia humana)
turing machine         
  • 3-state Busy Beaver. Black icons represent location and state of head; square colors represent 1s (orange) and 0s (white); time progresses vertically from the top until the '''HALT''' state at the bottom.
  • A Turing machine realization using [[Lego]] pieces
  • An implementation of a Turing machine
  • The evolution of the busy beaver's computation starts at the top and proceeds to the bottom.
  • finite-state representation]]. Each circle represents a "state" of the table—an "m-configuration" or "instruction". "Direction" of a state ''transition'' is shown by an arrow. The label (e.g. ''0/P,R'') near the outgoing state (at the "tail" of the arrow) specifies the scanned symbol that causes a particular transition (e.g. ''0'') followed by a slash ''/'', followed by the subsequent "behaviors" of the machine, e.g. "''P'' ''print''" then move tape "''R'' ''right''". No general accepted format exists. The convention shown is after McClusky (1965), Booth (1967), Hill, and Peterson (1974).
  • The head is always over a particular square of the tape; only a finite stretch of squares is shown. The instruction to be performed (q<sub>4</sub>) is shown over the scanned square. (Drawing after Kleene (1952) p. 375.)
  • Here, the internal state (q<sub>1</sub>) is shown inside the head, and the illustration describes the tape as being infinite and pre-filled with "0", the symbol serving as blank. The system's full state (its "complete configuration") consists of the internal state, any non-blank symbols on the tape (in this illustration "11B"), and the position of the head relative to those symbols including blanks, i.e. "011B". (Drawing after Minsky (1967) p. 121.)
  • Another Turing machine realization
ABSTRACT COMPUTATION MODEL; MATHEMATICAL MODEL OF COMPUTATION THAT DEFINES AN ABSTRACT MACHINE WHICH MANIPULATES SYMBOLS ON A STRIP OF TAPE ACCORDING TO A TABLE OF RULES
Turing Machine; Turing Machine simulator; Universal computation; Turing machines; Deterministic Turing machine; Universal computer; K-string Turing machine with input and output; Turing Machines; The Turing Machine; Universal computing machine; Turing-computable function; Turing table; A-machine
máquina de turing (nombre de un máquina teorética (automática) capaz de efectuar entradas y salidas simples que se usa para probarlas matemáticamente)
test case         
SPECIFICATION OF THE INPUTS, EXECUTION CONDITIONS, TESTING PROCEDURE, AND EXPECTED RESULTS THAT DEFINE A SINGLE TEST TO BE EXECUTED TO ACHIEVE A PARTICULAR TESTING OBJECTIVE
Test Case; Business test case; Business Test Case; Testcase; Common Test Cases; Test cases; Testcases
precedente legal, juicio de ensayo

Definition

test
sust. masc.
1) Prueba cuyo objeto es determinar la acción de un medicamento químico, o apreciar el estado de una función.
2) Psicología. Pedagogía. Prueba o reactivo que se utiliza para medir condiciones y aptitudes de un sujeto así como de su conducta, sentimientos, motivaciones y tendencias instintivas o estructuradas.
3) Voz invariable en plural.

Wikipedia

Turing test
The Turing test, originally called the imitation game by Alan Turing in 1950, is a test of a machine's ability to exhibit intelligent behaviour equivalent to, or indistinguishable from, that of a human. Turing proposed that a human evaluator would judge natural language conversations between a human and a machine designed to generate human-like responses.
Beispiele aus Textkorpus für Turing test
1. This is the so–called Turing test, devised in the 1'50s by the computer scientist Alan Turing.
2. They will pass the Turing Test in the 2020s, in which humans will not be able to tell whether they are conversing with a person or a computer.
3. The final criterion for any such reproduction is the rather imprecise "Turing test" of artificial intelligence÷ that is, whether it can make the listener think he or she is hearing a person rather than a machine. 1 2 3Next>> Next Article in Arts (1 of 18) >
4. "A lot of cutting edge AI has filtered into general applications, often without being called AI because once something becomes useful enough and common enough it‘s not labelled AI anymore." Although AI has enjoyed its headline–grabbing moments, such as when IBM‘s Deep Blue computer beat chess world champion Garry Kasparov in 1''7, no machine has yet come close to passing the "Turing Test" –– the conversational test devised by mathematician Alan Turing in 1'50 to determine whether a machine could "think." But Bostrom said that traditional "top–down" approaches to AI, in which programmers coded machined to cope with specific situations, were being supplemented by "bottom–up" systems inspired by enhanced understanding of the neural networks of the brain, leading to more subtle forms of AI.